Adaptive Distance Measures for Resolving K2P Quartets: Metric Separation versus Stochastic Noise

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive Distance Measures for Resolving K2P Quartets: Metric Separation versus Stochastic Noise

Distance-based phylogenetic reconstruction methods use the evolutionary distances between species in order to reconstruct the tree spanning them. The evolutionary distance between two species, which is computed from their DNA (or protein) sequences, is typically considered as a fixed function of these sequences, predetermined by the assumed model of evolution. This article continues the line of...

متن کامل

Adaptive distance measures for sequential data

Recent extensions of learning vector quantization (LVQ) to general (dis-)similarity data have paved the way towards LVQ classifiers for possibly discrete, structured objects such as sequences addressed by classical alignment. In this contribution, we propose a metric learning scheme based on this framework which allows for autonomous learning of the underlying scoring matrix according to a give...

متن کامل

Ball Versus Distance Convexity of Metric Spaces

We consider two different notions of convexity of metric spaces, namely (strict/uniform) ball convexity and (strict/uniform) distance convexity. Our main theorem states that (strict/uniform) distance convexity is preserved under a fairly general product construction, whereas we provide an example which shows that the same does not hold for (strict/uniform) ball convexity, not even when consider...

متن کامل

Efficient Stochastic Optimization for Low-Rank Distance Metric Learning

Although distance metric learning has been successfully applied to many real-world applications, learning a distance metric from large-scale and high-dimensional data remains a challenging problem. Due to the PSD constraint, the computational complexity of previous algorithms per iteration is at least O(d) where d is the dimensionality of the data. In this paper, we develop an efficient stochas...

متن کامل

Adaptive Distance Metric Learning for Diffusion Tensor Image Segmentation

High quality segmentation of diffusion tensor images (DTI) is of key interest in biomedical research and clinical application. In previous studies, most efforts have been made to construct predefined metrics for different DTI segmentation tasks. These methods require adequate prior knowledge and tuning parameters. To overcome these disadvantages, we proposed to automatically learn an adaptive d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational Biology

سال: 2010

ISSN: 1066-5277,1557-8666

DOI: 10.1089/cmb.2009.0236